Semirings for Social Networks Analysis
نویسنده
چکیده
In the paper four semirings for solving social networks problems are constructed. The closures of the matrix of a given signed graph over balance and cluster semirings can be used to decide whether the graph is balanced or clusterable. The closure of relational matrix over geodetic semiring contains for every pair of vertices and the length and the number of geodesics; and for geosetic semiring the length and the set of vertices on geodesics. The algorithms for computing the geodetic and the geosetic closure matrix are also given.
منابع مشابه
SCLP for Trust Propagation in Small-World Networks
We propose Soft Constraint Logic Programming based on semirings as a mean to easily represent and evaluate trust propagation in small-world networks. To attain this, we model the trust network adapting it to a weighted and-or graph, where the weight on a connector corresponds to the trust and confidence feedback values among the connected nodes. Semirings are the parametric and flexible structu...
متن کاملData Analysis Methods in Social Networks
Background and Aim. The promising outlook of easy communication incurring minimum cost has caused social networks to face increasing number of active members each day. These members develop and expand international communication through information sharing including personal information. Thus, big data analysis of social networks provides companies, organizations and governments with ample and ...
متن کاملAnalysis and Evaluation of Privacy Protection Behavior and Information Disclosure Concerns in Online Social Networks
Online Social Networks (OSN) becomes the largest infrastructure for social interactions like: making relationship, sharing personal experiences and service delivery. Nowadays social networks have been widely welcomed by people. Most of the researches about managing privacy protection within social networks sites (SNS), observes users as owner of their information. However, individuals cannot co...
متن کاملDistributive Lattices of λ-simple Semirings
In this paper, we study the decomposition of semirings with a semilattice additive reduct. For, we introduce the notion of principal left $k$-radicals $Lambda(a)={x in S | a stackrel{l}{longrightarrow^{infty}} x}$ induced by the transitive closure $stackrel{l}{longrightarrow^{infty}}$ of the relation $stackrel{l}{longrightarrow}$ which induce the equivalence relation $lambda$. Again non-transit...
متن کاملSome Automata{theoretic Aspects of Min{max{plus Semirings
This paper is devoted to the survey of some automata-theoretic aspects of diierent exotic semirings, i.e. semirings whose underlying set is some subset of R equiped with min, max or + as sum and/or product. We here adress three types of properties related with rational series with multiplicities in such semirings : structure of supports, decidability of equality and inequality problems, Fatou p...
متن کامل